Partitions with Parts in a Finite Set and with Parts Outside a Finite Set
نویسنده
چکیده
In a recent paper, M. B. Nathanson [Nathanson] finds the highest order term of the asymptotic formula for the number of partitions with parts in a finite set. This is done without referring to the partial fraction expansion of the generating function. In this paper, we essentially find the entire asymptotic formula without using partial fractions. This is done by the “metaphysical method” described in [Almkvist 98]. There the asymptotic formula was found using Fourier transformations of distributions in a rather obscure way. But when the generating function is rational, it is shown here that the method is perfectly sound. This is based on the following result:
منابع مشابه
Stirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملRegular coding partitions
The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In the case the set is not uniquely decipherable, it partitions the set into one unambiguous class and other parts that localize the ambiguities in the factorizations of finite sequences. We prove that the canonical codi...
متن کاملPartitions with Parts in a Finite Set
Abstract. For a finite set A of positive integers, we study the partition function pA(n). This function enumerates the partitions of the positive integer n into parts in A. We give simple proofs of some known and unknown identities and congruences for pA(n). For n in a special residue class, pA(n) is a polynomial in n. We examine these polynomials for linear factors, and the results are applied...
متن کاملTurbulent Flow in 2-D Domains with Complex Geometry-Finite Elelment Method
Using the highly recommended numerical techniques, a finite element computer code is developed to analyse the steady incompressible, laminar and turbulent flows in 2-D domains with complex geometry. The Petrov-Galerkin finite element formulation is adopted to avoid numerical oscillations. Turbulence is modeled using the two equation k-ω model. The discretized equations are written in the form o...
متن کاملTurbulent Flow in 2-D Domains with Complex Geometry-Finite Elelment Method
Using the highly recommended numerical techniques, a finite element computer code is developed to analyse the steady incompressible, laminar and turbulent flows in 2-D domains with complex geometry. The Petrov-Galerkin finite element formulation is adopted to avoid numerical oscillations. Turbulence is modeled using the two equation k-ω model. The discretized equations are written in the form o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Experimental Mathematics
دوره 11 شماره
صفحات -
تاریخ انتشار 2002